Abelian 1-Factorizations of the Complete Graph
نویسندگان
چکیده
منابع مشابه
Primitive 2-factorizations of the complete graph
LetF be a 2-factorization of the complete graphKv admitting an automorphism groupG acting primitively on the set of vertices. IfF consists of Hamiltonian cycles, thenF is the unique, up to isomorphisms, 2-factorization ofKpn admitting an automorphism group which acts 2-transitively on the vertex-set, see [A. Bonisoli, M. Buratti, G. Mazzuoccolo, Doubly transitive 2-factorizations, J. Combin.Des...
متن کاملSequentially Perfect and Uniform One-Factorizations of the Complete Graph
In this paper, we consider a weakening of the definitions of uniform and perfect one-factorizations of the complete graph. Basically, we want to order the 2n − 1 one-factors of a one-factorization of the complete graph K2n in such a way that the union of any two (cyclically) consecutive one-factors is always isomorphic to the same two-regular graph. This property is termed sequentially uniform;...
متن کاملOn sharply vertex transitive 2-factorizations of the complete graph
We introduce the concept of a 2-starter in a groupG of odd order.We prove that any 2-factorization of the complete graph admitting G as a sharply vertex transitive automorphism group is equivalent to a suitable 2-starter in G. Some classes of 2-starters are studied, with special attention given to those leading to solutions of some Oberwolfach or Hamilton–Waterloo problems. © 2005 Elsevier Inc....
متن کاملCycle factorizations and 1-faced graph embeddings
Consider factorizations into transpositions of an n-cycle in the symmetric group Sn. To every such factorization we assign a monomial in variables wij that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-fac...
متن کاملFair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs
A k-factor of a graph G is a k-regular spanning subgraph of G. A k-factorization is a partition of E(G) into k-factors. Let K(n, p) be the complete multipartite graph with p parts, each of size n. If V1, ..., Vp are the p parts of V (K(n, p)), then a holey k-factor of deficiency Vi of K(n, p) is a k-factor of K(n, p)− Vi for some i satisfying 1 ≤ i ≤ p. Hence a holey k-factorization is a set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2001
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0475